Generating Cut Conjunctions in Graphs and Related Problems
نویسندگان
چکیده
منابع مشابه
Enumerating Cut Conjunctions in Graphs and Related Problems
LetG = (V,E) be an undirected graph, and letB ⊆ V ×V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every vertex pair (s, t) ∈ B is disconnected in (V,ErX), generalizing well-known efficient algorithms for enumerating all minimal s-t cuts, for a given pair s, t ∈ V of vertices. We also present an incremental p...
متن کاملGenerating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every vertex pair (s, t) ∈ B is disconnected in (V, E r X), generalizing wellknown efficient algorithms for enumerating all minimal s-t cuts, for a given pair s, t ∈ V of vertices. We also present an increme...
متن کاملOn Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs
Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider this problem for trees and prove that the minimum bisection width of every tree T on n vertices satisfies MinBis(T ) ≤ 8n∆(T )/ diam(T ). Second, we general...
متن کاملAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
A minimal blocker in a bipartite graph G is a minimal set of edges the removal of which leaves no perfect matching in G. We give a polynomial delay algorithm for finding all minimal blockers of a given bipartite graph. Equivalently, this gives a polynomial delay algorithm for listing the anti-vertices of the perfect matching polytope P (G) = {x ∈ R | Hx = e, x ≥ 0}, where H is the incidence mat...
متن کاملOn DDoS Attack Related Minimum Cut Problems
In this paper, we study two important extensions of the classical minimum cut problem, called Connectivity Preserving Minimum Cut (CPMC) problem and Threshold Minimum Cut (TMC) problem, which have important applications in largescale DDoS attacks. In CPMC problem, a minimum cut is sought to separate a of source from a destination node and meanwhile preserve the connectivity between the source a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9111-9